A soft preemptive scheme for providing service differentiation in wavelength-routed networksHUA NAN; ZHENG XIAOPING; ZHANG HANYI et al.Proceedings of SPIE, the International Society for Optical Engineering. 2005, pp 602212.1-602212.9, issn 0277-786X, isbn 0-8194-6053-2, 2VolConference Paper

Efficient peer-to-peer lookup based on a distributed trieFREEDMAN, Michael J; VINGRALEK, Radek.Lecture notes in computer science. 2002, pp 66-75, issn 0302-9743, isbn 3-540-44179-4, 10 p.Conference Paper

Mapping the Gnutella network: Macroscopic properties of large-scale peer-to-peer systemsRIPEANU, Matei; FOSTER, Ian.Lecture notes in computer science. 2002, pp 85-93, issn 0302-9743, isbn 3-540-44179-4, 9 p.Conference Paper

Bandwidth sharing under the assured Forwarding Per-Hop BehaviorMEDINA, Octavio; OROZCO, Julio; ROS, David et al.Annales des télécommunications. 2004, Vol 59, Num 3-4, pp 439-466, issn 0003-4347, 28 p.Article

Recherche locale à voisinage variable pour le routage optique dans des réseaux utilisant des routeurs latins = Variable neighbourhood search for optical routing in networks using latin routersMERIC, Laurent; PESANT, Gilles; PIERRE, Samuel et al.Annales des télécommunications. 2004, Vol 59, Num 3-4, pp 261-286, issn 0003-4347, 26 p.Article

GMRP : problème généralisé de routage multipoint = GMRP: Generalized multicast routing problemBETTAHAR, Hatem; BOUABDALLAH, Abdelmajid.Annales des télécommunications. 2002, Vol 57, Num 9-10, pp 996-1012, issn 0003-4347, 17 p.Article

Minimum delay path selection in multi-homed systems with path asymmetryRIBEIRO, Eduardo Parente; LEUNG, Victor C. M.IEEE communications letters. 2006, Vol 10, Num 3, pp 135-137, issn 1089-7798, 3 p.Article

Finding disjoint paths with related path costsBHATIA, Randeep; KODIALAM, Murali; LAKSHMAN, T. V et al.Journal of combinatorial optimization. 2006, Vol 12, Num 1-2, pp 83-96, issn 1382-6905, 14 p.Article

Trees in a treemap : Visualizing multiple hierarchiesBURCH, Michael; DIEHL, Stephan.Proceedings of SPIE, the International Society for Optical Engineering. 2006, pp 60600P.1-60600P.12, issn 0277-786X, isbn 0-8194-6100-8, 1VolConference Paper

Comprehensive solution for anomaly-free BGPMUSUNURI, Ravi; COBB, Jorge A.Lecture notes in computer science. 2005, pp 130-141, issn 0302-9743, isbn 3-540-29356-6, 1Vol, 12 p.Conference Paper

Scheduling schemes for delay graphs with applications to optical packet networksKESLASSY, Isaac; KODIALAM, Murali; LAKSHMAN, T. V et al.Workshop on high performance switching and routing. 2004, pp 99-103, isbn 0-7803-8375-3, 1Vol, 5 p.Conference Paper

Topological-order based dynamic polling scheme using routing path for network monitoringBYOUNGWOO YOON; SEONGJIN AHN; JINWOOK CHUNG et al.Lecture notes in computer science. 2003, pp 292-301, issn 0302-9743, isbn 3-540-40456-2, 10 p.Conference Paper

Kademlia: A peer-to-peer information system based on the XOR metricMAYMOUNKOV, Petar; MAZIERES, David.Lecture notes in computer science. 2002, pp 53-65, issn 0302-9743, isbn 3-540-44179-4, 13 p.Conference Paper

Security considerations for peer-to-peer distributed hash tablesSIT, Emil; MORRIS, Robert.Lecture notes in computer science. 2002, pp 261-269, issn 0302-9743, isbn 3-540-44179-4, 9 p.Conference Paper

Wordlength as an architectural parameter for Reconfigurable Computing devicesSTANSFIELD, Tony.Lecture notes in computer science. 2002, pp 667-676, issn 0302-9743, isbn 3-540-44108-5, 10 p.Conference Paper

Minimum congestion embedding of complete binary trees into toriMATSUBAYASHI, A; TAKASU, R.Lecture notes in computer science. 1999, pp 370-378, issn 0302-9743, isbn 3-540-66200-6Conference Paper

Worst case bounds for shortest path interval routingGAVOILLE, C; GUEVREMONT, E.Journal of algorithms (Print). 1998, Vol 27, Num 1, pp 1-25, issn 0196-6774Article

Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networksGOMES, Teresa; CRAVEIRINHA, José.European journal of operational research. 2007, Vol 181, Num 3, pp 1055-1064, issn 0377-2217, 10 p.Conference Paper

Accelerating computation bounded IP Lookup methods by adding simple instructionsMOHAMMADI, Hossein; YAZDANI, Nasser.Lecture notes in computer science. 2004, pp 473-482, issn 0302-9743, isbn 3-540-23551-5, 10 p.Conference Paper

Multicast datagram delivery using xcast in IPv6 networksSHIN, Myung-Ki; KIM, Sang-Ha.Lecture notes in computer science. 2003, pp 263-272, issn 0302-9743, isbn 3-540-40827-4, 10 p.Conference Paper

Routing in Mobile ad Hoc and Peer-to-Peer networks a comparisonSCHOLLMEIER, Rüdiger; GRUBER, Ingo; FINKENZELLER, Michael et al.Lecture notes in computer science. 2002, pp 172-186, issn 0302-9743, isbn 3-540-44177-8, 15 p.Conference Paper

Agent-based distance Vector RoutingAMIN, Kaizar A; MAYES, John T; MIKLER, Armin R et al.Lecture notes in computer science. 2001, pp 41-50, issn 0302-9743, isbn 3-540-42460-1Conference Paper

Extending dynamic reconfiguration to NOWs with adaptive routingBERMUDEZ, A; ALFARO, F. J; CASADO, R et al.Lecture notes in computer science. 2000, pp 73-83, issn 0302-9743, isbn 3-540-67879-4Conference Paper

Unit-oriented communication in real-time multihop networksBALAJI, S; MANIMARAN, G; SIVA RAM MURTHY, C et al.Lecture notes in computer science. 1999, pp 381-388, issn 0302-9743, isbn 3-540-66907-8Conference Paper

Properties of the solutions to the problem of dynamic routing in networksVASIL'EV, N. S.Computational mathematics and mathematical physics. 1998, Vol 38, Num 1, pp 38-48, issn 0965-5425Article